Clique problem

Results: 134



#Item
21Improved Equilibrium Enumeration for Bimatrix Games Extended abstract June 30, 1998 Bernhard von Stengel

Improved Equilibrium Enumeration for Bimatrix Games Extended abstract June 30, 1998 Bernhard von Stengel

Add to Reading List

Source URL: www.maths.lse.ac.uk

Language: English - Date: 2006-11-15 07:54:44
22B. Balasundaram · S. Butenko · I. V. Hicks? · S. Sachdeva Clique Relaxations in Social Network Analysis: The Maximum k-plex Problem

B. Balasundaram · S. Butenko · I. V. Hicks? · S. Sachdeva Clique Relaxations in Social Network Analysis: The Maximum k-plex Problem

Add to Reading List

Source URL: www.caam.rice.edu

Language: English - Date: 2006-08-14 16:34:49
23JMLR: Workshop and Conference Proceedings vol 40:1–17, 2015 Label optimal regret bounds for online local learning Pranjal Awasthi∗ PAWASHTI @ CS . PRINCETON . EDU

JMLR: Workshop and Conference Proceedings vol 40:1–17, 2015 Label optimal regret bounds for online local learning Pranjal Awasthi∗ PAWASHTI @ CS . PRINCETON . EDU

Add to Reading List

Source URL: jmlr.org

Language: English - Date: 2015-07-20 20:08:35
24Networks Cannot Compute Their Diameter in Sublinear Time Preliminary version, please check for updates. Silvio Frischknecht Stephan Holzer

Networks Cannot Compute Their Diameter in Sublinear Time Preliminary version, please check for updates. Silvio Frischknecht Stephan Holzer

Add to Reading List

Source URL: www.tik.ee.ethz.ch

Language: English - Date: 2015-05-18 12:16:35
25CLIQUE DECOMPOSITIONS OF MULTIPARTITE GRAPHS AND COMPLETION OF LATIN SQUARES ¨ BEN BARBER, DANIELA KUHN, ALLAN LO, DERYK OSTHUS AND AMELIA TAYLOR Abstract. Our main result essentially reduces the problem of finding an e

CLIQUE DECOMPOSITIONS OF MULTIPARTITE GRAPHS AND COMPLETION OF LATIN SQUARES ¨ BEN BARBER, DANIELA KUHN, ALLAN LO, DERYK OSTHUS AND AMELIA TAYLOR Abstract. Our main result essentially reduces the problem of finding an e

Add to Reading List

Source URL: web.mat.bham.ac.uk

Language: English - Date: 2016-03-03 02:19:13
    26Statistical Algorithms and a Lower Bound for Detecting Planted Cliques Vitaly Feldman Almaden Research Center IBM San Jose, CA 95120

    Statistical Algorithms and a Lower Bound for Detecting Planted Cliques Vitaly Feldman Almaden Research Center IBM San Jose, CA 95120

    Add to Reading List

    Source URL: www.levreyzin.com

    Language: English - Date: 2013-03-20 23:48:10
    27LEARNING CIRCUITS AND NETWORKS BY INJECTING VALUES 1

    LEARNING CIRCUITS AND NETWORKS BY INJECTING VALUES 1

    Add to Reading List

    Source URL: www.levreyzin.com

    Language: English - Date: 2010-09-09 14:03:27
    28Sta$s$cal  Algorithms     and  the  Planted  Clique  Problem   (and  random  graphs,  linear  equa$ons,  &  machine  learning)    

    Sta$s$cal  Algorithms     and  the  Planted  Clique  Problem   (and  random  graphs,  linear  equa$ons,  &  machine  learning)    

    Add to Reading List

    Source URL: www.levreyzin.com

    Language: English - Date: 2015-11-09 17:26:18
    29LEARNING LARGE-ALPHABET AND ANALOG CIRCUITS WITH VALUE INJECTION QUERIES Dana Angluin1 James Aspnes1 Jiang Chen2

    LEARNING LARGE-ALPHABET AND ANALOG CIRCUITS WITH VALUE INJECTION QUERIES Dana Angluin1 James Aspnes1 Jiang Chen2

    Add to Reading List

    Source URL: www.levreyzin.com

    Language: English - Date: 2010-09-09 14:03:20
    30December 15, :20 WSPC - Proceedings Trim Size: 9.75in x 6.5in

    December 15, :20 WSPC - Proceedings Trim Size: 9.75in x 6.5in

    Add to Reading List

    Source URL: www.jsbi.org

    Language: English - Date: 2008-12-14 21:22:09